Adaptive Quantum State Tomography Improves Accuracy Quadratically
نویسندگان
چکیده
منابع مشابه
Practical adaptive quantum tomography
We introduce a fast and accurate heuristic for adaptive tomography that addressesmany of the limitations of priormethods. Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states. By contrast, our approach combines the efficiency of online optimizationwith generally applicable andwell-motivated data-processing techniq...
متن کاملEfficient quantum state tomography.
Quantum state tomography--deducing quantum states from measured data--is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes unfeasible because the number of measurements and the amount of computation required to process them grows exponentially in the system size. Here, we present two tom...
متن کاملReliable quantum state tomography.
Quantum state tomography is the task of inferring the state of a quantum system by appropriate measurements. Since the frequency distributions of the outcomes of any finite number of measurements will generally deviate from their asymptotic limits, the estimates computed by standard methods do not in general coincide with the true state and, therefore, have no operational significance unless th...
متن کاملFourier-transform quantum state tomography
We propose a technique for performing quantum state tomography of photonic polarization-encoded multiqubit states. Our method uses a single rotating wave plate, a polarizing beam splitter, and two photon-counting detectors per photon mode. As the wave plate rotates, the photon counters measure a pseudocontinuous signal which is then Fourier transformed. The density matrix of the state is recons...
متن کاملQuantum Computation and Quadratically Signed Weight Enumerators
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2013
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.111.183601